Geometric Inhomogeneous Random Graphs (GIRGs) Johannes Lengler (ETH Zürich) joint work with K. Bringmann, R. Keusch, C. Koch Motivation: Network Models

Source URL: www.mathematik.uni-muenchen.de

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexander Barvinok and J.A. Hartigan November 2011 Abstract. We consider the set of all graphs on n labeled vertices with prescribed

Source URL: www.math.lsa.umich.edu

• Mathematics
• Mathematical analysis
• Central limit theorem
• Regular graph
• Matrix
• Entropy
• Number theory
• Graph coloring
• Discriminant of an algebraic number field
• Differential forms on a Riemann surface

ON THE VARIATIONAL PROBLEM FOR UPPER TAILS IN SPARSE RANDOM GRAPHS EYAL LUBETZKY AND YUFEI ZHAO Abstract. What is the probability that the number of triangles in Gn,p , the Erd˝ os-R´enyi random graph with edge density

Source URL: yufeizhao.com

Oberwolfach Report: Combinatorics and Probability, April 2013 Large deviations in random graphs Yufei Zhao (joint work with Eyal Lubetzky) The goal of this talk is to answer the following question of Chatterjee and Varad

Source URL: yufeizhao.com

Internat. Math. Nachrichten Nr), 1–24 Random Graphs: Theory and Applications from Nature to Society to the Brain

Source URL: www.math.tugraz.at

UPPER TAILS AND INDEPENDENCE POLYNOMIALS IN RANDOM GRAPHS BHASWAR B. BHATTACHARYA, SHIRSHENDU GANGULY, EYAL LUBETZKY, AND YUFEI ZHAO Abstract. The upper tail problem in the Erd˝ os-R´enyi random graph G ∼ Gn,p asks t

Source URL: yufeizhao.com

Random graphs from constrained classes Marc Noy UPC Barcelona ALEA in Europe M¨

Source URL: www.mathematik.uni-muenchen.de

Completely random measures for modeling power laws in sparse graphs Diana Cai Department of Statistics University of Chicago

Source URL: stanford.edu

Random Cubic Planar Graphs Manuel Bodirsky,1, * Mihyun Kang,1, † Mike Löffler,1 Colin McDiarmid2 1 Humboldt-Universität zu Berlin, Institut für Informatik, Unter den Linden 6, DBerlin, Germany;

Source URL: www.math.tugraz.at

APPROXIMATE HAMILTON DECOMPOSITIONS OF RANDOM GRAPHS ¨ FIACHRA KNOX, DANIELA KUHN AND DERYK OSTHUS Abstract. We show that if pn  log n the binomial random graph Gn,p has an

Source URL: web.mat.bham.ac.uk